Nonsingular Block Graphs: An Open Problem
نویسندگان
چکیده
A block graph is a graph in which every block is a complete graph (clique). Let G be a block graph and let A(G) be its (0,1)-adjacency matrix. Graph G is called nonsingular (singular) if A(G) is nonsingular (singular). Characterizing nonsingular block graphs, other than trees, is an interesting open problem. In this article, we give some classes of nonsingular and singular block graphs and related conjectures.
منابع مشابه
On the adjacency matrix of a block graph
A block graph is a graph in which every block is a complete graph. Let G be a block graph and let A be the adjacency matrix of G. We first obtain a formula for the determinant of A over reals. It is shown that A is nonsingular over IF2 if and only if the removal of any vertex from G produces a graph with exactly one odd component. A formula for the inverse of A over IF2 is obtained, whenever it...
متن کاملMatching structure of symmetric bipartite graphs and a generalization of Pólya's problem
A bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. This paper investigates matching structure of symmetric bipartite graphs. We first apply the Dulmage-Mendelsohn decomposition to a symmetric bipartite graph. The resulting components, which are matching-covered, turn out to have symmetry. We then decompose a matching-covered bipartite graph via an ear de...
متن کاملOn The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings
Let G be a simple, undirected graph and Gw be the positive weighted graph obtained from G by giving weights to its edges using the positive weight function w. A weighted graph Gw is said to be nonsingular if its adjacency matrix A(Gw) is nonsingular. Let G denote the class of connected, unweighted, bipartite graphs G with a unique perfect matching M such that G/M (the graph obtained by contract...
متن کاملOn signed digraphs with all cycles negative
It is known that signed graphs with all cycles negative are those in which each block is a negative cycle or a single line. We now study the more difficult problem for signed digraphs. In particular we investigate the structure of those digraphs whose arcs can be signed (positive or negative) so that every (directed) cycle is negative. Such digraphs are important because they are associated wit...
متن کاملOn Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کامل